Counting Quiddities of Polygon Dissections
نویسندگان
چکیده
منابع مشابه
Counting polygon dissections in the projective plane
For each value of k ≥ 2, we determine the number pn of ways of dissecting a polygon in the projective plane into n subpolygons with k + 1 sides each. In particular, if k = 2 we recover a result of Edelman and Reiner (1997) on the number of triangulations of the Möbius band having n labelled points on its boundary. We also solve the problem when the polygon is dissected into subpolygons of arbit...
متن کاملCounting symmetry classes of dissections of a convex regular polygon
This paper proves explicit formulas for the number of dissections of a convex regular polygon modulo the action of the cyclic and dihedral groups. The formulas are obtained by making use of the Cauchy-Frobenius Lemma as well as bijections between rotationally symmetric dissections and simpler classes of dissections. A number of special cases of these formulas are studied. Consequently, some kno...
متن کاملEfficient Regular Polygon Dissections
We study the minimum number g(m,n) (respectively, p(m, n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that dn/2e − 2 ≤ g(4, n) ≤ n 2 + o(n) and dn/4e ≤ g(n, 4) ≤ n 2 + o(n) hold for sufficiently large n. We also consider polygonal cuts, i.e., the min...
متن کاملPolygon Dissections Complexes Are Shellable
All dissections of a convex (mn + 2)-gons into (m + 2)-gons are facets of a simplicial complex. This complex is introduced by S. Fomin and A.V. Zelevinsky in [7]. We reprove the result of E. Tzanaki about shellability of such complex by finding a concrete shelling order. Also, we use this shelling order to find a combinatorial interpretation of h-vector and to describe the generating facets of ...
متن کاملPolygon Dissections and Standard Young Tableaux
A simple bijection is given between dissections of a convex n gon with d diagonals not intersecting in their interiors and standard Young tableaux of shape d d n d Partially supported by National Science Foundation grant DMS For d n let f n d be the number of ways to draw d diagonals in a convex n gon such that no two diagonals intersect in their interior For instance f n n is just the Catalan ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Mathematical Intelligencer
سال: 2022
ISSN: ['0343-6993', '1866-7414']
DOI: https://doi.org/10.1007/s00283-022-10180-3